Ristretto MRE: A generalized multi‐shot GRE‐MRE sequence
نویسندگان
چکیده
منابع مشابه
Compressing Java Binaries — The Ristretto Project
This thesis presents the development of a wire format for Java applications. Whereas file formats, such as the Java class file format, put nowadays the emphasis on the ease with which they can be manipulated at the expense of the space they need, a wire format is specialized to achieve short transmission times. A wire format puts hence the emphasis on the space needed and takes a complex decodi...
متن کاملA Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کاملMultishot for High Spatial Resolution
Conventional Cartesian non-diffusion pulse sequences acquire k-space in multiple excitations (a.k.a. shots). As the phase errors originating from motion during the diffusion preparation time are random in nature and large compared to the phase used to spatially encode the image, the use of multi-shot sequences with diffusion gradients is not straightforward, and in most cases severe image ghost...
متن کاملMRE: A Study on Evolutionary Language Understanding
The lack of well-annotated data is always one of the biggest problems for most training-based dialogue systems. Without enough training data, it’s almost impossible for a trainable system to work. In this paper, we explore the evolutionary language understanding approach to build a natural language understanding machine in a virtual human training project. We build the initial training data wit...
متن کاملGeneralized Alcuin's Sequence
We introduce a new family of sequences {tk(n)}n=−∞ for given positive integer k > 3. We call these new sequences as generalized Alcuin’s sequences because we get Alcuin’s sequence which has several interesting properties when k = 3. Also, {tk(n)}n=0 counts the number of partitions of n − k with parts being k, (k − 1), 2 (k − 1), 3 (k − 1), . . . , (k − 1) (k − 1). We find an explicit linear rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: NMR in Biomedicine
سال: 2019
ISSN: 0952-3480,1099-1492
DOI: 10.1002/nbm.4049